Dynamic traffic assignment in a corridor network: Optimum versus equilibrium

This study investigates dynamic system-optimal (DSO) and user equilibrium (DUE) traffic assignment of departure/arrival-time choices in a corridor network. A morning commute problem with many-to-one pattern origin–destination (OD) demand an evening one-to-many OD are considered. Specifically, we first derive closed-form solution to the DSO based on regularities cost flow variables. By utilizing this solution, prove that bottleneck queuing delay DUE is equal optimal toll eliminates queue under certain conditions schedule function. enables us from solution. We also show theoretical relationships between assignment. Numerical examples provided illustrate verify analytical results.